|
|
Palaeoecological aspects and evolution of the Late Cretaceous oyster assemblages
Rantuch, Jakub ; Košťák, Martin (advisor) ; Mergl, Michal (referee) ; Reháková, Daniela (referee)
The presented thesis explores the palaeoecological aspects of the evolution of the well-known fossil oyster genus Rhynchostreon Bayle, 1874, a significant representative of Cretaceous fauna. The study integrates sedimentological (quartz grain size), geochemical (concentration of major oxides) and palaeobiological (taphonomy) proxies to categorise five oyster-bearing localities in the Bohemian Massif and the Pieniny Klippen Belt (Western Carpathians) into three environments with differing substrate characteristics, environmental energy levels and salinity regimes. Subsequently, the five specific palaeopopulations of Rhynchostreon suborbiculatum (Lamarck, 1801), occupying these habitats (including the dynamic Cenomanian nearshore, the quiet environment of the Turonian hemipelagic sea and the Cenomanian-Turonian marginal marine system influenced by variable fluvial activity), underwent a series of morphological and population studies. These studies involved the analyses of size-frequency distributions, morphotype structure, and shell thickness. Results from this multidisciplinary approach suggest that the salinity tolerance of R. suborbiculatum may be higher than commonly assumed, and its ecological response to climatic changes (i.e. the fluctuation of salinity, level of eutrophism, etc.) aligns with...
|
|
|
The Red Queen
Králík, Martin ; Zálešák, Jan (referee) ; Gabriel, Michal (advisor)
Red Queen is a chess piece on the story of Alice in Wonderland, which is constantly running to hold it in place, because the world around it is constantly in motion. Therefore, it is a symbol of the theory of evolution, a constant necessity innovation and the eternal escape from competitors. Red Queen's Race is constructed into a miniature civilization, or rather one growing superorganism, which constantly oscillates between the digital and the physical world. The main consciousness of this association is black majestically looking server that supplies with his computing power and energy all attached printers. They are designed specifically for this purpose, such as abstraction of robotics industry, with an emphasis on a functionally aesthetic form, in yellow-orange color of heavy industrial machinery. The most important and largest part of this system, are entities which printers materialize. They are created according to a living creature of this world, generated by computer, based on a unique code, which is the result of calculating the evolutionary recombination, processed by the server, depending on the reactions of outside observers at the objects which are already created. Sense of each entity is attract attention. How much more, the greater is the chance to continue their code in future generations.
|
|
|
Evolutionary algorithms
Haupt, Daniel ; Polách, Petr (referee) ; Honzík, Petr (advisor)
The first part of this work deals with the optimization and evolutionary algorithms which are used as a tool to solve complex optimization problems. The discussed algorithms are Differential Evolution, Genetic Algorithm, Simulated Annealing and deterministic non-evolutionary algorithm Taboo Search.. Consequently the discussion is held on the issue of testing the optimization algorithms through the use of the test function gallery and comparison solution all algorithms on Travelling salesman problem. In the second part of this work all above mentioned optimization algorithms are tested on 11 test functions and on three models of placement cities in Travelling salesman problem. Firstly, the experiments are carried out with unlimited number of accesses to the fitness function and secondly with limited number of accesses to the fitness function. All the data are processed statistically and graphically.
|
|
|
Simulation of Entities Collective Behavior in Virtual World
Vymazal, Tomáš ; Žák, Pavel (referee) ; Láník, Aleš (advisor)
Theme of this work is to evaluate and compare aviable paradigms for entity control in virtual worlds, and to implement one of these paradigms in application. Dynamic finite state machine upgraded using genetic algorithms has been chosen. This paradigm should make agent's behavior better and adapt agent to required state: i.e. make agent harvest resources in virtual world. Output of this work is application for running evolution and application for 3D view of agent's behavior.
|
|
|
A Tool for Visual Analysis of Circuit Evolution
Staurovská, Jana ; Minařík, Miloš (referee) ; Sekanina, Lukáš (advisor)
The main goal of the master's thesis is to compose a study on cartesian genetic programming with focus on evolution of circuits and to design a concept for visualisation of this evolution. Another goal is to create a program to visualise the circuit evolution in cartesian genetic programming, its generations and chromosomes. The program is capable of visualising the changes between generations and chromosomes and comparing more chromosomes at once. Several user cases had been prepared for the resulting program.
|
|
|
Prediction of Transposons in DNA
Černohub, Jan ; Vogel, Ivan (referee) ; Martínek, Tomáš (advisor)
Cílem práce je seznámení se s problematikou uchovávání informace v DNA, provést rešerši na téma transpozony, bioinformatické nástroje a algoritmy, které jsou používány k jejich detekci v nasekvenovaných genomech a vytvořit tak stručný úvod do obsáhle problematiky, včetně jejího zasazení do kontextu současně probíhajícího výzkumu v dané oblasti. Na základě přehledu stávajících algoritmů a nástrojů pro detekci transpozonů je navržen a implementován nástroj pro hledání tzv. LTR transpozonů.
|
|
|
Genetic Improvement of Cartesian Genetic Programming Software
Husa, Jakub ; Jaroš, Jiří (referee) ; Sekanina, Lukáš (advisor)
Genetic programming is a nature-inspired method of programming that allows an automated creation and adaptation of programs. For nearly two decades, this method has been able to provide human-comparable results across many fields. This work gives an introduction to the problems of evolutionary algorithms, genetic programming and the way they can be used to improve already existing software. This work then proposes a program able to use these methods to improve an implementation of cartesian genetic programming (CGP). This program is then tested on a CGP implementation created specifically for this project, and its functionality is then verified on other already existing implementations of CGP.
|
|
|
Evolutionary Solving of the Rubik's Cube
Mališ, Radim ; Sekanina, Lukáš (referee) ; Jaroš, Jiří (advisor)
This thesis deals with an evolutionary solving of the Rubik's cube. The worldwide known puzzle has been for several decades not only a toy for children and adults, but also almost a lifestyle for crowds of fans and definitely a big challenge in the world of computation, where scientists seek to find an effective automated solution. The potential for its solution could also be borne by evolutionary algorithms. The author of this thesis has developed an application employing, apart from genetic algorithms, also many advanced technics, such as linear genetic programming or local search. The goal of this special technics is to make the evolutionary process more effective. There have also been made tests of the crossover, the population size and the mutation probability influence. All the tests have been statistically evaluated.
|
|
|
Evolutionary models for evaluation of organisms relationship
Gregorová, Kateřina ; Maděránková, Denisa (referee) ; Škutková, Helena (advisor)
The work is focused on the study and description of evolutionary models for the evaluation of the evolutionary distances of DNA sequences and protein sequences in the amino acids and the codon representation. In the framework of this work was created a program that evaluates the genetic distance between DNA sequences and protein sequences for the use of some evolutionary models. The program calculates the genetic distance of the compared sequences and on the basis thereof renders the phylogenetic tree. This can be relatively easily and quickly evaluate the affinity of the organisms. For easy operation is part of the evaluation program also graphical user interface (GUI).
|
|
|
Historical Overwiev of F1 Chassis and Engines Evolution
Hrudík, Jan ; Svída, David (referee) ; Dundálek, Radim (advisor)
This thesis is focused on the overwiev of main periods in the area of race car construction development. In the first chapter, main attention is dedicated to Formula One cars, attending races since 1950. In spite of this, there is briefly noted the technological development before FIA Formula One Championship. Next chapter is dealing with technical restrictions and regulations restraining construction of Formula One car. Data are situated in the table, ascending sequenced according to the year. Next part refers to the actual Fia Formula One Championship season 2008. There is abstract of technical regulations and the list of actual Formula One teams, their cars and drivers. There is some pages acting with one of the Formula One team. In the last chapter some of technological experiments are presented.
|
guest ::
